The Carpenter’s Ruler Folding Problem
نویسندگان
چکیده
A carpenter’s ruler is a ruler divided into pieces of different lengths which are hinged where the pieces meet, which makes it possible to fold the ruler. The carpenter’s ruler folding problem, originally posed by Hopcroft, Joseph and Whitesides, is to determine the smallest case (or interval on the line) into which the ruler fits when folded. The problem is known to be NP-complete. The best previous approximation ratio achieved, dating from 1985, is 2. We improve this result and provide a fully polynomial-time approximation scheme for this problem. In contrast, in the plane, there exists a simple linear-time algorithm which computes an exact (optimal) folding of the ruler in some convex case of minimum diameter. This brings up the interesting problem of finding the minimum area of a convex universal case (of unit diameter) for all rulers whose maximum link length is one.
منابع مشابه
An algorithmic study of manufacturing paperclips and other folded structures
We study algorithmic aspects of bending wires and sheet metal into a specified structure. Problems of this type are closely related to the question of deciding whether a simple non-self-intersecting wire structure (a carpenter’s ruler) can be straightened, a problem that was open for several years and has only recently been solved in the affirmative. If we impose some of the constraints that ar...
متن کاملA Linear Time Approximation Algorithm for Ruler Folding Problem
A chain or n-link is a sequence of n links whose lengths are fixed and are joined together from their endpoints, free to turn about their endpoints, which act as joints. “Ruler Folding Problem”, which is NP-Complete is to find the minimum length of the folded chain. The best linear approximation algorithm for it were proposed by Hopcroft et al. Their algorithm folds any open chain in the interv...
متن کاملFolding Rulers inside Triangles
An l-ruler is a chain of n links, each of length l. The links, which are allowed to cross, are modelled by line segments whose endpoints act as joints. A given connguration of an l-ruler is said to fold if it can be moved to a connguration in which all its links coincide. We show that l-rulers connned inside an equilateral triangle of side 1 exhibit the following surprising alternation property...
متن کاملA Constraint-Based Approach to the Golomb Ruler Problem
A Golomb ruler with m marks can be defined as a set of m distinct integers such that the differences between them are all distinct. An optimal Golomb ruler minimizes the value of the largest mark. The Golomb ruler problem is highly combinatorial and difficult to solve efficiently even for small sizes. Golomb rulers and related problems play an important role in, e.g., radio communication, VLSI ...
متن کاملA Mathematical Theory of Origami Constructions and Numbers
About twelve years ago, I learned that paper folding or elementary origami could be used to demonstrate all the Euclidean constructions; the booklet, [9], gives postulates and detailed the methods for high school teachers. Since then, I have noticed a number of papers on origami and variations, [3], [2] and even websites [7]. What are a good set of axioms and what should be constructible all ca...
متن کامل